Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan
نویسندگان
چکیده
One way of building more powerful theorem provers is to use techniques from symbolic computation. The challenge problems in this paper are taken from Chapter 2 of Ramanu-jan's Notebooks. They were selected because they are non-trivial and require the use of symbolic computation techniques. We have developed a theorem prover based on the symbolic computation system Mathematica that can prove all the challenge problems completely automatically. The axioms and inference rules for constructing the proofs are also brieey discussed.
منابع مشابه
User Evaluator Simplifier
Solving sophisticated mathematical problems often requires algebraic algorithms and theorems. However, there are no environments integrating theorem provers and computer algebra systems which consistently provide the inference capabilities of the rst and the powerful arithmetic of the latter systems. As an example for such a mechanized mathematics environment we describe a prototype implementat...
متن کاملCombining Theorem Proving and Symbolic Mathematical Computing
An intelligent mathematical environment must enable symbolic mathematical computation and sophisticated reasoning techniques on the underlying mathematical laws. This paper disscusses diierent possible levels of interaction between a symbolic calculator based on algebraic algorithms and a theorem prover. A high level of interaction requires a common knowledge representation of the mathematical ...
متن کاملUsing Computer Algebra for Automated Reasoning in the Theorema System ABSTRACT
While most of the Automated Reasoning systems (see e.g. [8]) are based on purely logical approaches, many researchers started during the last decade to believe that solving non-trivial problems is only possible by using additionally algorithms from Computer Algebra. This is only natural, since most of human made proofs use complex computations, and in fact some researchers advocated the combina...
متن کاملTheorem Proving in Intel Hardware Design
For the past decade, a framework combining model checking (symbolic trajectory evaluation) and higher-order logic theorem proving has been in production use at Intel. Our tools and methodology have been used to formally verify execution cluster functionality (including floating-point operations) for a number of Intel products, including the Pentium R © 4 and CoreTMi7 processors. Hardware verifi...
متن کاملAnalytica - A Theorem Prover in Mathematica
Current automatic theorem provers, particularly those based on some variant of resolution, have concentrated on obtaining ever higher inference rates by using clever programming techniques, parallelism, etc. We believe that this approach is unlikely to lead to a useful system for actually doing mathematics. The main problem is the large amount of domain knowledge that is required for even the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994